Empirical Distributions of Laplacian Matrices of Large Dilute Random Graphs

نویسنده

  • Tiefeng Jiang
چکیده

We study the spectral properties of the Laplacian matrices and the normalized Laplacian matrices of the Erdös-Rényi random graph G(n, pn) for large n. Although the graph is simple, we discover some interesting behaviors of the two Laplacian matrices. In fact, under the dilute case, that is, pn ∈ (0, 1) and npn → ∞, we prove that the empirical distribution of the eigenvalues of the Laplacian matrix converges to a deterministic distribution, which is the free convolution of the semicircle law and N(0, 1). However, for its normalized version, we prove that the empirical distribution converges to the semi-circle law.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectral Distributions of Adjacency and Laplacian Matrices of Random Graphs By

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the Laplacian matrices; (ii) under some further independent conditions, the normalized largest eigenvalues of the Laplacian matrices are dense in a compact interval ...

متن کامل

Spectral Distributions of Adjacency and Laplacian Matrices of Random Graphs

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the Laplacian matrices; (ii) under some further independent conditions, the normalized largest eigenvalues of the Laplacian matrices are dense in a compact interval a...

متن کامل

Random Incidence Matrices: Moments of the Spectral Density

We study numerically and analytically the spectrum of incidence matrices of random labeled graphs on N vertices : any pair of vertices is connected by an edge with probability p. We give two algorithms to compute the moments of the eigenvalue distribution as explicit polynomials in N and p. For large N and fixed p the spectrum contains a large eigenvalue at Np and a semi-circle of “small” eigen...

متن کامل

NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS

In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...

متن کامل

Traffic distributions and independence: permutation invariant random matrices and the three notions of independence

The distributions of traffics are defined and are applied for families of larges random matrices, random groups and infinite random rooted graphs with uniformly bounded degree. There are constructed by adding axioms in Voiculescu’s definition of ∗-distribution of non commutative random variables. The convergence in distribution of traffics generalizes Benjamini, Schramm, Aldous, Lyons’ weak loc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012